A General Method to Determine Asymptotic Capacity Upper Bounds for Wireless Networks
نویسندگان
چکیده
Capacity scaling laws offer fundamental understanding on the trend of user throughput behavior when the network size increases. Since the seminal work of Gupta and Kumar, there have been active research efforts in developing capacity scaling laws for ad hoc networks under various advanced physical (PHY) layer technologies. These efforts led to many custom-designed solutions, most of which were mathematically challenging and lacked general properties that can be extended to address scaling laws of ad hoc networks with other PHY layer technologies. So a question is: can we have a general methodology to obtain asymptotic capacity results for various PHY layer technologies? In this paper, we present a simple yet powerful method to determine capacity upper bounds under the protocol model. We prove the correctness of our proposed method and demonstrate its applications to various PHY layer technologies, including directional antenna, MIMO, multi-channel multi-radio, cognitive radio, multiple packet reception, and full-duplex radio. This new method offers a simple tool to researchers to quickly determine asymptotic capacity of wireless networks with a particular PHY layer technology without the need to resort to complex custom-designed analysis as done in the literature.
منابع مشابه
Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملCapacity-Delay Scaling in Arbitrary Wireless Networks
Gupta and Kumar (2000) studied capacity scaling in random wireless networks with n nodes under the protocol interference model. They showed that the per source-destination pair capacity scales as Θ(1/ √ n logn) when n distinct random source-destination pairs communicate simultaneously. For the same setup, El Gamal, Mammen, Prabhakar and Shah (2004) showed that the delay scales as Θ( √ n/ logn)....
متن کاملImpact of deployment size on the asymptotic capacity for wireless ad hoc networks under Gaussian channel model
We study the throughput capacity and transport capacity for both random and arbitrary wireless networks under Gaussian Channel model when all wireless nodes have the same constant transmission power P and the transmission rate is determined by Signal to Interference plus Noise Ratio (SINR). We consider networks with n wireless nodes {v1, v2, · · · , vn} (randomly or arbitrarily) distributed in ...
متن کاملA New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملOn the Asymptotic Minimum Energy Required to Transport Packets in Wireless Networks
In this paper we study the asymptotic minimum energy required to transport (via multiple hops) data packets from a source to a destination. Under the assumptions that nodes are distributed according to a Poisson point process with node density n in a unit-area square and the distance between a source and a distance is at least a constant, we prove, based on percolation theory, the minimum energ...
متن کامل